Universal 3-dimensional visibility representations for graphs
نویسندگان
چکیده
منابع مشابه
Universal 3-Dimensional Visibility Representations for Graphs
This paper studies 3-dimensional visibility representations of graphs in which objects in 3-d correspond to vertices and vertical visibilities between these objects correspond to edges. We ask which classes of simple objects are universal, i.e. powerful enough to represent all graphs. In particular, we show that there is no constant k for which the class of all polygons having k or fewer sides ...
متن کاملSERIE B INFORMATIK Universal Dimensional Visibility Representations for Graphs
This paper studies dimensional visibility representations of graphs in which objects in d correspond to vertices and vertical visibilities between these objects correspond to edges We ask which classes of simple objects are universal i e powerful enough to represent all graphs In particular we show that there is no constant k for which the class of all polygons having k or fewer sides is univer...
متن کاملVisibility Representations of Complete Graphs
In this paper we study 3-dimensional visibility representations of complete graphs. The vertices are represented by equal regular polygons lying in planes parallel to the xy-plane. Two vertices are adjacent if and only if the two corresponding polygons see each other i.e. it is possible to construct an abscissa perpendicular to the xy-plane connecting the two polygons and avoiding all the other...
متن کامل1-Visibility Representations of 1-Planar Graphs
A visibility representation is a classical drawing style of planar graphs. It displays the vertices of a graph as horizontal vertexsegments, and each edge is represented by a vertical edge-segment touching the segments of its end vertices; beyond that segments do not intersect. We generalize visibility to 1-visibility, where each edge(vertex-) segment crosses at most one vertex(edge-) segment. ...
متن کاملRectangle-Visibility Representations of Bipartite Graphs
The paper considers representations of bipartite graphs as rectangle-visibility graphs, Le., graphs whose vertices are rectangles in the plane, with adjacency detenmned by horizontal and vertical visibility.1t is shown that, for p ~ q, Kp,q has a representation with no rectangles having collinear sides if and only if p ~ 2 or p = 3 and q ~ 4. More generally, it is shown that Kp;q is a rectangle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1998
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(97)00015-1